The Ellis semigroup of a nonautonomous discrete dynamical system

We introduce the {\it Ellis semigroup} of a nonautonomous discrete dynamical system $(X,f_{1,\infty})$ when $X$ is a metric compact space. The underlying set of this semigroup is the pointwise closure of \{f\sp{n}_1 \, |\, n\in \mathbb{N}\} in the space X\sp{X}. By using the convergence of a sequence of points with respect to an ultrafilter it is possible to give a precise description of the semigroup and its operation. This notion extends the classical Ellis semigroup of a discrete dynamical system. We show several properties that connect this semigroup and the topological properties of the nonautonomous discrete dynamical system

Structure, mass and distance of the Virgo cluster from a Tolman-Bondi model

We have applied a relativistic Tolman-Bondi model of the Virgo cluster to a sample of 183 galaxies with measured distances within a radius of 8 degrees from M87. We find that the sample is significantly contaminated by background galaxies which lead to too large a cluster mean distance if not excluded. The Tolman-Bondi model predictions, together with the HI deficiency of spiral galaxies, allows one to identify these background galaxies. One such galaxy is clearly identified among the 6 calibrating galaxies with Cepheid distances. As the Tolman-Bondi model predicts the expected distance ratio to the Virgo distance, this galaxy can still be used to estimate the Virgo distance, and the average value over the 6 galaxies is 15.4 +- 0.5 Mpc. Well-known background groups of galaxies are clearly recovered, together with filaments of galaxies which link these groups to the main cluster, and are falling into it. No foreground galaxy is clearly detected in our sample. Applying the B-band Tully-Fisher method to a sample of 51 true members of the Virgo cluster according to our classification gives a cluster distance of 18.0 +- 1.2 Mpc, larger than the mean Cepheid distance. Finally, the same model is used to estimate the Virgo cluster mass, which is M = 1.2 10^{15} Msun within 8 degrees from the cluster center (2.2 Mpc radius), and amounts to 1.7 virial mass.Comment: 12 pages, 7 figures. Astronomy and Astrophysics, in press (accepted May 31, 2001

Searching for BcB_c mesons in the ATLAS experiment at LHC

We discuss the feasibility of the observation of the signal from $B_c$ mesons in the ATLAS experiment of the LHC collider at a luminosity of ${\approx}\ 10^{33}$cm$^{-2}$s$^{-1}$. In particular we address the decay mode$B_c{\rightarrow}J/\psi \pi$followed by the leptonic decay$J/\psi{\rightarrow}\mu^+\mu^-$, which should permit an accurate measurement of the$B_c$mass. We performed a Monte Carlo study of the signal and background concluding that a precision of$40$MeV for the$B_c$ mass could be achieved after one year of running.Comment: Latex,7 pages including 3 uuencoded Postscript figures appended at the end of the latex fil

Studying the capacity of cellular encoding to generate feedforward neural network topologies

Proceeding of: IEEE International Joint Conference on Neural Networks, IJCNN 2004, Budapest, 25-29 July 2004Many methods to codify artificial neural networks have been developed to avoid the disadvantages of direct encoding schema, improving the search into the solution's space. A method to analyse how the search space is covered and how are the movements along search process applying genetic operators is needed in order to evaluate the different encoding strategies for multilayer perceptrons (MLP). In this paper, the generative capacity, this is how the search space is covered for a indirect scheme based on cellular systems, is studied. The capacity of the methods to cover the search space (topologies of MLP space) is compared with the direct encoding scheme.Publicad

Recurrent points of continuous functions on connected linearly ordered spaces

Let L be a connected linearly ordered topological space and let f be a continuous function from L into itself. if P (f) and R(f) denote the set of periodic points and the set of recurrent points of f respectively, we show that the center of f is $cl_{L}P(f)$ and the depth of the center is at most 2. Furthermore we have $cl_{L}P(f)=cl_{L}R(f)$

Development and initial validation of a sensory threshold examination protocol (STEP) for phenotyping canine pain syndromes

Objective To study feasibility and test-retest repeatability of a sensory threshold examination protocol (STEP) and report quantitative sensory threshold distributions in healthy dogs. Study design Prospective, observational, cohort study. Animals Twenty-five healthy client-owned dogs. Methods Tactile sensitivity (TST) (von Frey filaments), mechanical thresholds (MT with 2, 4 and 8 mm probes), heat thresholds (HT) and responsiveness to cold stimulus (CT at 0 °C) were quantitatively assessed for five body areas (BA: tibias, humeri, neck, thoracolumbar region and abdomen) in a randomized order on three different occasions. Linear Mixed Model and Generalised Linear Mixed models were used to evaluate the effects of body weight category, age, sex, BA, occasion, feasibility score and investigator experience. Test-retest repeatability was evaluated with the Intra-class Correlation Coefficient (ICC). Results The STEP lasted 90 minutes without side effects. The BA affected most tests (p = 0.001). Higher thresholds and longer cold latencies were scored in the neck (p = 0.024) compared to other BAs. Weight category affected all thresholds (p = 0.037). Small dogs had lower MT (~1.4 N mean difference) and HT (1.1 0C mean difference) than other dogs (p = 0.029). Young dogs had higher HT than adults (2.2 0C mean difference) (p = 0.035). Gender also affected TST, MT and HT (p < 0.05) (females versus males: TST OR= 0.5, MT= 1.3 N mean difference, HT= 2.2 0C mean difference). Repeatability was substantial to moderate for all tests, but poor for TST. There was no difference in thresholds between occasions, except for CT. Test-retest repeatability was slightly better with the 2 mm MT probe compared to other diameters and improved with operator experience. Conclusions and clinical relevance The STEP was feasible, well tolerated and showed substantial test-retest repeatability in healthy dogs. Further validation is needed in dogs suffering pain

Neural Network architectures design by Cellular Automata evolution

4th Conference of Systemics Cybernetics and Informatics. Orlando, 23-26 July 2000The design of the architecture is a crucial step in the successful application of a neural network. However, the architecture design is basically, in most cases, a human experts job. The design depends heavily on both, the expert experience and on a tedious trial-and-error process. Therefore, the development of automatic methods to determine the architecture of feedforward neural networks is a field of interest in the neural network community. These methods are generally based on search techniques, as genetic algorithms, simulated annealing or evolutionary strategies. Most of the designed methods are based on direct representation of the parameters of the network. This representation does not allow scalability, so to represent large architectures very large structures are required. In this work, an indirect constructive encoding scheme is proposed to find optimal architectures of feed-forward neural networks. This scheme is based on cellular automata representations in order to increase the scalability of the method.Publicad